On the Bi-Lipschitz Geometry of Lamplighter Graphs
نویسندگان
چکیده
منابع مشابه
Bi-lipschitz Sufficiency of Jets
We give some theorems of bi-Lipschitz or C sufficiency of jets which are expressed by means of transversality with respect to some strata of a stratification satisfying the (L) condition of T. Mostowski. This enables us to prove that the number of metric types of intersection of smooth transversals to a stratum of an (a) regular stratification of a subanalytic set is finite.
متن کاملGeometry of Lipschitz Percolation
We prove several facts concerning Lipschitz percolation, including the following. The critical probability pL for the existence of an open Lipschitz surface in site percolation on Z with d ≥ 2 satisfies the improved bound pL ≤ 1−1/[8(d−1)]. Whenever p > pL, the height of the lowest Lipschitz surface above the origin has an exponentially decaying tail. For p sufficiently close to 1, the connecte...
متن کاملBi-Lipschitz Decomposition of Lipschitz functions into a Metric space
We prove a quantitative version of the following statement. Given a Lipschitz function f from the k-dimensional unit cube into a general metric space, one can be decomposed f into a finite number of BiLipschitz functions f |Fi so that the k-Hausdorff content of f([0, 1] r ∪Fi) is small. We thus generalize a theorem of P. Jones [Jon88] from the setting of R to the setting of a general metric spa...
متن کاملsurvey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولUniform Mixing Time for Random Walk on Lamplighter Graphs
Suppose that G is a finite, connected graph and X is a lazy random walk on G. The lamplighter chain X associated with X is the random walk on the wreath product G = Z2 oG, the graph whose vertices consist of pairs (f, x) where f is a labeling of the vertices of G by elements of Z2 and x is a vertex in G. There is an edge between (f, x) and (g, y) in G if and only if x is adjacent to y in G and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2020
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-020-00184-1